- implicit definability
- Математика: неявная определимость
Универсальный англо-русский словарь. Академик.ру. 2011.
implicit definability
Смотреть что такое "implicit definability" в других словарях:
Beth definability — In mathematical logic, Beth definability states that for any two models A , B of a first order theory T in the language L ⊇ L, if A | L = B | L (where A | L is the reduct of A to L ) implies that for all tuples a of A , A ⊨ φ [ a ] if and only if … Wikipedia
Structure (mathematical logic) — In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations which are defined on it. Universal algebra studies structures that generalize the algebraic structures such as… … Wikipedia
History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium
logic, history of — Introduction the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic There was a medieval tradition according to which the Greek philosopher … Universalium
Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… … Wikipedia
